optimal capacities in discrete facility location design problem

Authors

ali shahandeh nookabadi isfahan university of tech.

mohammad reza yadoolahpour isfahan university of tech.

soheila kavosh isfahan university of tech.

abstract

network location models comprise one of the main categories of location models. these models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. in a network location problem, nodes represent demand points and candidate locations to locate the facilities. if the links network is unchangeably determined, the problem will be an flp (facility location problem). however, if links can be added to the network at a reasonable cost, the problem will then be a combination of facility location and ndp (network design problem) hence, called flndp (facility location network design problem), a more general variant of flp. in previous studies of this problem, capacity of facilities was considered to be a constraint while capacity of links was not considered at all. the proposed mip model considers capacity of facilities and links as decision variables. this approach increases the utilization of facilities and links, and prevents the construction of links and location of facilities with low utilization. furthermore, facility location cost (link construction cost) in the proposed model is supposed to be a function of the associated facility (link) capacity. computational experiments as well as sensitivity analyses performed indicate the efficiency of the model.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Optimal Capacities in Discrete Facility Location Design Problem

Network location models comprise one of the main categories of location models. These models have various applications in regional and urban planning as well as in transportation, distribution, and energy management. In a network location problem, nodes represent demand points and candidate locations to locate the facilities. If the links network is unchangeably determined, the problem will be ...

full text

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candida...

full text

Sequential Competitive Facility Location Problem in a Discrete Planar Space

In this paper, there are two competitors in a planar market. The first competitor, called, the leader, opens p new facilities. After that, the second competitor, the follower, reacts to the leader’s action and opens r new facilities. The leader and the follower have got some facilities in advance in this market. The optimal locations for leader and follower are chosen among predefined candidate...

full text

Dynamic Facility Location with Generalized Modular Capacities

Location decisions are frequently subject to dynamic aspects such as changes in customer demand. Often, flexibility regarding the geographic location of facilities, as well as their capacities, is the only solution to such issues. Even when demand can be forecast, finding the optimal schedule for the deployment and dynamic adjustment of capacities remains a challenge, especially when the cost s...

full text

Facility Location with Nonuniform Hard Capacities

In this paper we give the first constant factor approximation algorithm for the Facility Location Problem with nonuniform, hard capacities. Facility location problems have received a great deal of attention in recent years. Approximation algorithms have been developed for many variants. Most of these algorithms are based on linear programming, but the LP techniques developed thus far have been ...

full text

Solution of Discrete Competitive Facility Location Problem for Firm Expansion

A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the a...

full text

My Resources

Save resource for easier access later


Journal title:
international journal of industrial engineering and productional research-

جلد ۲۴، شماره ۱، صفحات ۸۱-۸۹

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023